#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <map> 

#define flr(x, l, r) for (int x = l; x <= r; ++x)
#define frl(x, r, l) for (int x = r; x >= l; --x)
#define fmp(x, t) for (int x = h[t]; ~x; x = ne[x])
#define LL long long
#define mt memset
#define my memcpy
#define szf sizeof
#define INF 0x3f3f3f3f
#define in(x) scanf("%d", &x)
#define out(x) printf("%d", x)
#define inll(x) scanf("%lld", &x)
#define outll(x) printf("%lld", x)
#define pn printf("\n")
#define con continue
#define bk break
#define vc vector
#define pb push_back
#define sz size
#define PII pair<int, int>
#define x first
#define y second
#define P_q priority_queue
#define ft front
#define pf push_front
#define popf pop_front
#define it insert
#define ct count

using namespace std;

const int N = 6010;

int n;
struct Edge {
    int a, b, w;
    bool operator< (const Edge &W) const {
        return w < W.w;
    }
}e[N];
int p[N], siz[N];

int find(int x) {
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}

int main() {
	int T;
	in(T);
	
	while (T -- ) {
	    in(n);
	    flr (i, 0, n - 2) {
	        int a, b, c;
	        in(a), in(b), in(c);
	        e[i] = {a, b, c};
	    }
	    
	    sort(e, e + n - 1);
	    
	    flr (i, 1, n) p[i] = i, siz[i] = 1;
	    
	    int res = 0;
	    flr (i, 0, n - 2) {
	        int a = find(e[i].a), b = find(e[i].b), w = e[i].w;
	        if (a != b) {
	            res += (siz[b] * siz[a] - 1) * (w + 1);
	            siz[b] += siz[a];
	            p[a] = b;
	        }
	    }
	    
	    out(res), pn;
	}
    
    return 0;
}